Extended Term Rewriting Systems
نویسندگان
چکیده
In this paper we will consider some extensions of the usual term rewrite format, namely: term rewriting with conditions, infmi~y term rewriting and term rewriting with bound variables. Rather than aiming at a complete survey, we discuss some aspects of these three extensions.
منابع مشابه
Combining Computer Algebra and Rule Based Reasoning
We present extended term rewriting systems as a means to describe a simpliication relation for an equational speciication with a built-in domain of external objects. Even if the extended term rewriting system is canonical, the combined relation including built-in computations of`ground terms' needs neither be terminating nor connuent. We investigate restrictions on the extended term rewriting s...
متن کاملPersistence of Termination for Term Rewriting Systems with Ordered Sorts
A property is persistent if for any many-sorted term rewriting system , has the property if and only if term rewriting system , which results from by omitting its sort information, has the property . Zantema showed that termination is persistent for term rewriting systems without collapsing or duplicating rules. In this paper, we show that the Zantema’s result can be extended to term rewriting ...
متن کاملConvergence in Infinitary Term Graph Rewriting Systems is Simple (Extended Abstract)
Citation for published version (APA): Bahr, P. (2013). Convergence in infinitary term graph rewriting systems is simple (extended abstract). In R. Echahed, & D. Plump (Eds.), Proceedings of the 7th International Workshop on Computing with Terms and Graphs: Rome, 23th March 2013 (pp. 17-28). Open Publishing Association. Electronic Proceedings in Theoretical Computer Science, Vol.. 110, DOI: 10.4...
متن کاملTerm Rewriting Systems : Syntax , Semantics , and Pragmatics Extended
We present a formalism called Addressed Term Rewriting Systems, which can be used to define the operational semantics of programming languages, especially those involving sharing, recursive computations and cyclic data structures. Addressed Term Rewriting Systems are therefore well suited for describing object-based languages, as for instance the family of languages called λObja, involving both...
متن کاملThe Hierarchy of Dependency Pairs
abstract: Recently, dependency pairs have greatly extended the provable class of terminating of term rewriting systems. The set of dependency pairs itself makes a term rewriting system. However, a term rewriting system and its dependency pairs do not accurately agree on the termination property. In this paper, we study the relation for the termination property between a term rewriting system, t...
متن کامل